A Kleene Theorem for Polynomial Coalgebras

نویسندگان

  • Marcello M. Bonsangue
  • Jan J. M. M. Rutten
  • Alexandra Silva
چکیده

For polynomial functors G, we show how to generalize the classical notion of regular expression to G-coalgebras. We introduce a language of expressions for describing elements of the final G-coalgebra and, analogously to Kleene’s theorem, we show the correspondence between expressions and finite G-coalgebras.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coalgebraic Expressions

We show that certain fixpoint expressions used to describe finite Kripke polynomial coalgebras can be seen as coalgebraic modal fixpoint formulae. Both the synthesis of a coalgebra from its expression and the ability to check behavioural equivalence follow from the same tableau construction. There is an associated complete equational logic, analogous to Kleene algebra, which may now be seen as ...

متن کامل

Parikh's Theorem in Commutative Kleene Algebra

Parikh’s Theorem says that the commutative image of every context free language is the commutative image of some regular set. Pilling has shown that this theorem is essentially a statement about least solutions of polynomial inequalities. We prove the following general theorem of commutative Kleene algebra, of which Parikh’s and Pilling’s theorems are special cases: Every finite system of polyn...

متن کامل

Automatic Equivalence Proofs for Non-deterministic Coalgebras

A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene’s theorem and Kleene algebra, were recently proposed by a subset of the authors of this paper. Examples of the systems covered include infinite streams, deterministic automata, Mealy machines and labelled transition systems. In this paper, we present a novel algorithm to dec...

متن کامل

A Calculus of Terms for Coalgebras of Polynomial Functors

A syntax and semantics of types, terms and formulas for coalgebras of polynomial functors is developed, extending earlier work [4] on monomial coalgebras to include functors constructed using coproducts. A modified ultrapower construction for polynomial coalgebras is introduced, adapting the conventional ultrapower to retain only those states that evaluate observable terms in a standard way. A ...

متن کامل

N ov 2 00 3 Symmetric Coalgebras

We construct a structure of a ring with local units on a co-Frobenius coalgebra. We study a special class of co-Frobenius coalgebras whose objects we call symmetric coalgebras. We prove that any semiperfect coalgebra can be embedded in a symmetric coalgebra. A dual version of Brauer's equivalence theorem is presented, allowing a characterization of symmetric coalgebras by comparing certain func...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009